Short certificates for chromatic equivalence
نویسندگان
چکیده
منابع مشابه
Certificates of Factorisation for Chromatic Polynomials
The chromatic polynomial gives the number of proper λ-colourings of a graph G. This paper considers factorisation of the chromatic polynomial as a first step in an algebraic study of the roots of this polynomial. The chromatic polynomial of a graph is said to have a chromatic factorisation if P (G,λ) = P (H1, λ)P (H2, λ)/P (Kr , λ) for some graphs H1 and H2 and clique Kr. It is known that the c...
متن کاملShort Certificates for Tournaments
An isomorphism certificate of a labeled tournament T is a labeled subdigraph of T which together with an unlabeled copy of T allows the errorless reconstruction of T . It is shown that any tournament on n vertices contains an isomorphism certificate with at most n log2 n edges. This answers a question of Fishburn, Kim and Tetali. A score certificate of T is a labeled subdigraph of T which toget...
متن کاملCertificates for Triangular Equivalence and Rank Profiles
In this paper, we give novel certificates for triangular equivalence and rank profiles. These certificates enable to verify the row or column rank profiles or the whole rank profile matrix faster than recomputing them, with a negligible overall overhead. We first provide quadratic time and space non-interactive certificates saving the logarithmic factors of previously known ones. Then we propos...
متن کاملComputing Certificates of Regular Expression Equivalence
Deciding the equivalence of regular expressions is a fundamental problem of theoretical computer science. On one hand, there are several decision procedures to solve this problem. On the other hand, there are several axiomatisations of the equivalence of regular expression. The axiomatisations are proved to be complete and the proofs consists of showing that each steps of a decision procedure c...
متن کاملShort Score Certificates for Upset Tournaments
A score certificate for a tournament, T , is a collection of arcs of T which can be uniquely completed to a tournament with the same scorelist as T ’s, and the score certificate number of T is the least number of arcs in a score certificate of T . Upper bounds on the score certificate number of upset tournaments are derived. The upset tournaments on n vertices are in one–to–one correspondence w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2019
ISSN: 1526-1719
DOI: 10.7155/jgaa.00490